A heuristic discussion of probabilistic decoding
نویسنده
چکیده
This is another in a series of invited tutorial, status and survey papers that are being regularly solicited by the PTGIT Committee on Special Papers. We invited Profess01 Fano to commit to paprr his elegant but, unelaborate explanation of the principles of sequential decoding, a scheme which is currently contending for a position as the most practical implementation to dale of Shannon’s theory of noisy communication channels. -&e&l Pcqwrs Committw.
منابع مشابه
Convolutional source encoding
[l] J. M. Wozencraft , “Sequential decoding for reliable communication,” SC. D. dissertation, Dep. Elec. Eng., M.I.T., Cambridge, June 1957. [2] A. J. Viterbi, “Error bounds for convolutional codes and an asymptotically opt imum decoding algorithm,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, Apr. 1967. [3] R. G. Gallager, Information Theory and Reliable Communicat ion. New York: W ile...
متن کاملProbabilistic Integrated Planning of Primary and Secondary Distribution Networks based on a Hybrid Heuristic and GA Approach
The integrated planning of distribution system reveals a complex and non-linear problem being integrated with integer and discontinues variables. Due to these technical and modeling complexities, many researchers tend to optimize the primary and secondary distribution networks individually which depreciates the accuracy of the results. Accordingly, the integrated planning of these networks is p...
متن کاملDESIGN OF MINIMUM SEEPAGE LOSS IRRIGATION CANAL SECTIONS USING PROBABILISTIC SEARCH
To ensure efficient performance of irrigation canals, the losses from the canals need to be minimized. In this paper a modified formulation is presented to solve the optimization model for the design of different canal geometries for minimum seepage loss, in meta-heuristic environment. The complex non-linear and non-convex optimization model for canal design is solved using a probabilistic sear...
متن کاملA Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier
This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Becau...
متن کاملApproximation Methods for Solving the Equitable Location Problem with Probabilistic Customer Behavior
Location-allocation of facilities in service systems is an essential factor of their performance. One of the considerable situations which less addressed in the relevant literature is to balance service among customers in addition to minimize location-allocation costs. This is an important issue, especially in the public sector. Reviewing the recent researches in this field shows that most of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 9 شماره
صفحات -
تاریخ انتشار 1963